Space-Time Bounds for Collision Detection

نویسنده

  • Philip M. Hubbard
چکیده

Collision detection and response is an important but costly component of computer animation. We identify three basic reasons why collision-detection algorithms can be slow. We present a new collision-detection algorithm that directly addresses two of these problems and that prepares us for future work on the third. Our algorithm is based on a four-dimensional structure that puts a conservative bound on motion through time, even if that motion is speciied interactively by a user. The empirical results we present suggest that our algorithm performs signiicantly better than previous algorithms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Collision detection for objects modelled by CSG

Physically based computer animation has to deal with the problem of detecting collisions of moving objects and preventing solid objects from interpenetration. This paper discusses a method for detecting collisions among complex objects modelled with the constructive solid geometry paradigm. Bounding volumes in each node of the CSG tree are used to determine as soon as possible whether a collisi...

متن کامل

Detecting Collisions in Graph-Driven Motion Synthesis

In this paper we consider detecting collisions between characters whose motion is specified by motion capture data. We consider rough collisions, modeling the characters as a disk in the floor plane. To provide efficient collision detection, we introduce a hierarchical bounding volume, the Motion Oriented Bounding Box tree (MOBB tree). A MOBBtree stores space-time bounds of a motion clip. In cr...

متن کامل

On Selective Unboundedness of VASS1

Numerous properties of vector addition systems with states amount to checking the (un)boundedness of some selective feature (e.g., number of reversals, counter values, run lengths). Some of these features can be checked in exponential space by using Rackoff’s proof or its variants, combined with Savitch’s Theorem. However, the question is still open for many others, e.g., regularity detection p...

متن کامل

New Bounding Volume Approach for Detecting Collision in Computer Animation

This paper presents a method for fast-approximate collision detection between 3D models S undergoing rigid body motion known as oriented convex polyhedra R(S). By enclosing 3D models tightly, the fineness of detected collision can be enhanced. It is known that the large number of void areas which belongs to any 3D bounding volumes B(S) can affect the accuracy of collision detection system. Ther...

متن کامل

Collision Detection of Functionally Defined Objects for Constant Time

The problem of collision detection of functionally defined objects based on perturbation functions for constant time is considered. The collision detection algorithm of different complexity during a constant time is discussed. Recursive object space subdivision algorithm is proposed. In the perturbation function representation, collision detection becomes trivial due to the inside/outside prope...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993